Production Control of a Flexible Manufacturing System in a Job Shop Environment

نویسندگان

  • KARL-WERNER HANSMANN
  • MICHAEL HOECK
چکیده

This paper provides an application oriented analysis of local search procedures for Operation Scheduling and Shop Floor Management of a major German manufacturer of cigarette machines. The heuristics applied are the Thresholdand Simulated Annealing-Algorithm considering Job Shop as well as embedded FMS production features. In this context a new neighbourhood search technique is developed, which is based on a small set of local neighbourhoods and is flexible with respect to the performance measurements of production control. By this approach the scheduling, loading and workload allocation problems of a production facility consisting of an embedded FMS and a conventional Job Shop can be solved simultaneously.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

A Comparison of Job-Shop and Group Technology Using Simulation by ARENA

Production planning is performed through diverse methods according to the type of the system it is structured upon. One of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. Both job-shop and group-technology systems have their own pros and cons, each of which is suitable to a specific kind of factory. ...

متن کامل

A Comparison of Job-Shop and Group Technology Using Simulation by ARENA

Production planning is performed through diverse methods according to the type of the system it is structured upon. One of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. Both job-shop and group-technology systems have their own pros and cons, each of which is suitable to a specific kind of factory. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004